A Tool Architecture to Verify Properties of Multiagent System at Runtime

نویسندگان

  • Denis Meron
  • Bruno Mermet
چکیده

This paper describes an architecture allowing to verify properties of a multiagent system during its execution. This architecture is the basis of our study whose goal is to check at runtime, if agents and more generally multiagent systems satisfy requirements. Considering that a correct system is a system verifying the properties specified by the designer, we are interested in the “property” notion. That is why we give here a definition of “property” and we present an architecture to validate them. The architecture, a multiagent system itself, is based on a set of agents which goal is to check at runtime the whole system’s properties. So after a brief description of the “property” notion, we describe our architecture and the way to check systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed Runtime Verification of JADE and Jason Multiagent Systems with Prolog

Verifying properties of interactions taking place inside open, complex, distributed, dynamic systems is of paramount importance for most applications and is mandatory for safety-critical ones. Verification can take place at design time (o✏ine or static verification) or at runtime (online or dynamic). For runtime verification some layer between the monitor executing the verification engine and t...

متن کامل

A C-Language Binding for PSL

In recent years we have seen an increase in the complexity of embedded system design and in the difficulties of their verification. As a result, engineers have been trying to verify the specifications at a higher level of abstraction. In this paper we present an automated tool which is able to perform runtime verification of a program’s logical properties asserted by the programmer. The idea is...

متن کامل

A Multiagent Reinforcement Learning algorithm to solve the Community Detection Problem

Community detection is a challenging optimization problem that consists of searching for communities that belong to a network under the assumption that the nodes of the same community share properties that enable the detection of new characteristics or functional relationships in the network. Although there are many algorithms developed for community detection, most of them are unsuitable when ...

متن کامل

Automatic Partitions Extraction to Distribute the Runtime Verification of a Global Specification

Trace expressions are a compact and expressive formalism, initially devised for runtime verification of agent interactions in multiagent systems (MAS), which has been successfully employed to model real protocols, and to generate monitors for mainstream multiagent system platforms, and generalized to support runtime verification of different kinds of properties and systems. In this paper we pre...

متن کامل

Towards Supporting Multiple Execution Environments for UML/OCL Models at Runtime (Position Paper)

Our approach allows a developer to verify whether a model corresponds to a concrete implementation in terms of the JVM (Java Virtual Machine) by validating assumptions about model structure and behavior. In previous work, we focused on (a) the validation of static model properties by monitoring invariants, (b) basic dynamic properties by specifying preand postconditions of an operation and (c) ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006